Variable projection without smoothness
نویسندگان
چکیده
Variable projection is a powerful technique in optimization. Over the last 30 years, it has been applied broadly, with empirical and theoretical results demonstrating both greater efficacy and greater stability than competing approaches. In this paper, we illustrate the technique on a large class of structured nonsmooth optimization problems, with numerical examples in sparse deconvolution and machine learning applications.
منابع مشابه
Smoothness equivalence properties of univariate subdivision schemes and their projection analogues
We study the following modification of a linear subdivision scheme S: Let M be a surface embedded in Euclidean space, and P a smooth projection mapping onto M . Then the P -projection analogue of S is defined as T := P ◦ S. As it turns out, the smoothness of the scheme T is always at least as high as the smoothness of the underlying scheme S or the smoothness of P minus 1, whichever is lower. T...
متن کاملInterpretable Projection Pursuit*
The goal of this thesis is to modify projection pursuit by trading accuracy for interpretability. The modification produces a more parsimonious and understandable model without sacrificing the structure which projection pursuit seeks. The method retains the nonlinear versatility of projection pursuit while clarifying the results. Following an introduction which outlines the dissertation, the fi...
متن کاملA data-driven functional projection approach for the selection of feature ranges in spectra with ICA or cluster analysis
Prediction problems from spectra are largely encountered in chemometry. In addition to accurate predictions, it is often needed to extract information about which wavelengths in the spectra contribute in an effective way to the quality of the prediction. This implies to select wavelengths (or wavelength intervals), a problem associated to variable selection. In this paper, it is shown how this ...
متن کاملIsotropic Regularization
Regularization of ill-posed problems has been applied in various ways to surface reconstruction problems. Typically the smoothness term has been found in an ad hoc manner. In this work the a priori knowledge of the surface is used to construct the smoothness terms. If all surface normals are considered equally probable, different smoothness terms can be derived for different projections using B...
متن کاملHiding an Image inside another Image using Variable-Rate Steganography
A new algorithm is presented for hiding a secret image in the least significant bits of a cover image. The images used may be color or grayscale images. The number of bits used for hiding changes according to pixel neighborhood information of the cover image. The exclusive-or (XOR) of a pixel’s neighbors is used to determine the smoothness of the neighborhood. A higher XOR value indicates less ...
متن کامل